Paraconsistent Stable Semantics for Extended Disjunctive Programs
نویسندگان
چکیده
This paper presents declarative semantics of possibly inconsistent disjunctive logic programs. We introduce the paraconsistent minimal and stable model semantics for extended disjunctive programs, which can distinguish inconsistent information from others in a program. These semantics are based on lattice-structured multi-valued logics, and are characterized by a new xpoint semantics of extended disjunctive programs. Applications of the paraconsistent semantics for reasoning in inconsistent programs are also presented.
منابع مشابه
Extended Well-Founded Semantics for Paraconsistent Logic Programs
This paper presents a declarative semantics of logic programs which possibly contain inconsistent information. We introduce a multi-valued interpretation of logic programs and present the extended well-founded semantics for paraconsistent logic programs. In this setting, a meaningful information is still available in the presence of an inconsistent information in a program and any fact which is...
متن کاملA Declarative Characterisation of Disjunctive Paraconsistent Answer Sets
In this work, paraconsistent answer sets for extended disjunctive logic programs are presented in terms of a fully declarative approach. In order to do that, we introduce a frame-based semantics. It is known frames are a powerful and elegant tool which have been used to characterise and study substructural logics. Unlike the original definition, no kind of syntactic operation (like the program ...
متن کاملA Declarative Characterization of Disjunctive Paraconsistent Answer Sets
In this work, paraconsistent answer sets for extended disjunctive logic programs are presented as a fully declarative approach. In order to do so, we introduce a frame-based semantics. Frames are a powerful and elegant tool which have been used to characterise and study substructural logics. Unlike the original definition, no kind of syntactic transformation is employed. Indeed, paraconsistent ...
متن کاملEquivalence for the G3'-stable models semantics
We study the notion of strong equivalence between two disjunctive logic programs under the G3-stable model semantics, also called the P-stable semantics, and we show how some particular cases of testing strong equivalence between programs can be reduced to verify if a formula is a theorem in some paraconsistent logics or in some cases in classical logic. We also present some program transformat...
متن کاملHandling Inconsistency in Knowledge Bases
Real-world automated reasoning systems, based on classical logic, face logically inconsistent information, and they must cope with it. It is onerous to develop such systems because classical logic is explosive. Recently, progress has been made towards semantics that deal with logical inconsistency. However, such semantics was never analyzed in the aspect of inconsistency tolerant relational mod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Comput.
دوره 5 شماره
صفحات -
تاریخ انتشار 1995